Generators for discrete polynomial L1 approximation problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation Algorithms for Discrete Polynomial Optimization

In this paper, we consider approximation algorithms for optimizing a generic multivariate polynomial function in discrete (typically binary) variables. Such models have natural applications in graph theory, neural networks, error-correcting codes, among many others. In particular, we focus on three types of optimization models: (1) maximizing a homogeneous polynomial function in binary variable...

متن کامل

Unicity in piecewise polynomial L1-approximation via an algorithm

Our main result shows that certain generalized convex functions on a real interval possess a unique best L1 approximation from the family of piecewise polynomial functions of fixed degree with varying knots. This result was anticipated by Kioustelidis in [11]; however the proof given there is nonconstructive and uses topological degree as the primary tool, in a fashion similar to the proof the ...

متن کامل

Some Polynomial Problems Arising from Padé Approximation

In the convergence theory of Padé approximation, one needs to estimate the size of a set on which a suitably normalized polynomial q is small. For example, one needs to estimate the size of the set of r 2 [0; 1] for which max jtj=1 jq (t)j =min jtj=r jq (t)j is not “too large”. We discuss some old and new problems of this type, and the methods used to solve them. 1. Introduction Let f be a func...

متن کامل

Polynomial Time Approximation Schemes for Class-Constrained Packing Problems

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di<erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can accommodate. In the class-constrained multiple knapsack (CCMK) problem, our goal is to maximize ...

متن کامل

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo’s parametric method we improve an earlier weakly-polynomial time algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Research of the National Bureau of Standards

سال: 1979

ISSN: 0160-1741

DOI: 10.6028/jres.084.023